Uncertain Programming Models for Shortest Path Problem with Uncertain Arc Lengths
نویسنده
چکیده
Shortest path problem is a fundamental problem in network optimization and combinational optimization. The existing literature mainly concerned with the problem in deterministic, stochastic or fuzzy environments by using different tools. Different from the existing works, we investigate shortest path problem by regarding arc lengths as uncertain variables which are employed to describe the behavior of uncertain phenomena. According to different decision criteria, three concepts of path are proposed in uncertain environment, and three types of uncertain programming models are formulated. Furthermore, these models are concerted into deterministic optimization models in several special cases. keywords: Uncertain programming; Shortest path problem; Uncertainty measure; Uncertain variable.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملA Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks
In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP) due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the ...
متن کاملDistributionally robust stochastic shortest path problem
This paper considers a stochastic version of the shortest path problem, the Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, the arc costs are deterministic, while each arc has a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed known, but the exact information of the distribution is unknown. A penalty...
متن کاملNew models for shortest path problem with fuzzy arc lengths
This paper considers the shortest path problem with fuzzy arc lengths. According to different decision criteria, the concepts of expected shortest path, a-shortest path and the most shortest path in fuzzy environment are originally proposed, and three types of models are formulated. In order to solve these models, a hybrid intelligent algorithm integrating simulation and genetic algorithm is pr...
متن کامل